#include"SearchBinaryTree.h"

void TestBSTree()
{
	int a[] = { 8, 3, 1, 10, 6, 4, 7, 14, 13 };
	emm::BSTree<int> t;
	for (auto e : a)
	{
		t.Insert(e);
	}

	t.InOrder();
	cout << endl;
}


int main()
{
	TestBSTree();

	return 0;
}